Flexible Furnace Concepts for Vacuum Heat Treatment Combined with High-pressure Gas Quenching

IN the past five years the process combination of vacuum hardening, respectively vacuum carburizing with high-pressure gas quenching was successfully introduced to the market, especially in the manufacture of gears. In the meantime furnace concepts for various applications are available to the industry. In the following report three plant varieties are introduced, which differ in process flexibility and throughput. This report also explains criteria for the selection of a furnace in view of the existing application requirements. Besides this a short introduction is given into the vacuum carburizing process and the high-pressure gas quenching technology.     

Production of niobium powder by magnesiothermic reduction of niobium oxides in a cyclone reactor

In the last years, a variety of processes respectively process steps have been investigated for the production of niobium powder. This is due to the fact that niobium capacitors could be a viable alternative to tantalum capacitors from a performance, availability, and price point of view. The reduction of niobium pentoxide by magnesium results in fine powders with high specific surface area but has the disadvantages of a very exothermic nature and the formation of magnesium niobate. It is shown in this work that the application of a continuously operating cyclone reactor and the use of niobium(IV) oxide as raw material solve these problems. A good control of the highly exothermic reaction within the cyclone reactor was achieved in the cyclone reactor by the ratio between gas flow rate and powder flow rate as well as by a proper preheating of the gas.     

Siamese multi-layer perceptrons for dimensionality reduction and face identification

This paper presents a framework using siamese Multi-layer Perceptrons (MLP) for supervised dimensionality reduction and face identification. Compared with the classical MLP that trains on fully labeled data, the siamese MLP learns on side information only, i.e., how similar of data examples are to each other. In this study, we compare it with the classical MLP on the problem of face identification. Experimental results on the Extended Yale B database demonstrate that the siamese MLP training with side information achieves comparable classification performance with the classical MLP training on fully labeled data. Besides, while the classical MLP fixes the dimension of the output space, the siamese MLP allows flexible output dimension, hence we also apply the siamese MLP for visualization of the dimensionality reduction to the 2-d and 3-d spaces.     

Moving loads on flexible structures presented in the floating frame of reference formulation

The introduction of moving loads in the Floating Frame of Reference Formulation is presented. We derive the kinematics and governing equations of motion of a general flexible multibody system and their extension to moving loads. The equivalence of convective effects with Coriolis and centripetal forces is shown. These effects are measured numerically and their significance in moving loads traveling at high speed is confirmed. A method is presented to handle discontinuities when moving loads separate from the flexible structure. The method is extended from beam models to general flexible structures obtained by means of the Finite Element Method. An interpolation method for the deformation field of the modal representation of these bodies is introduced.The work is concluded by application of the method to modern mechanical problems in numerical simulations.     

A competitive study of the pseudoflow algorithm for the minimum <Emphasis Type="Italic">s</Emphasis>–<Emphasis Type="Italic">t</Emphasis> cut problem in vision applications

Rapid advances in image acquisition and storage technology underline the need for real-time algorithms that are capable of solving large-scale image processing and computer-vision problems. The minimum s–t cut problem, which is a classical combinatorial optimization problem, is a prominent building block in many vision and imaging algorithms such as video segmentation, co-segmentation, stereo vision, multi-view reconstruction, and surface fitting to name a few. That is why finding a real-time algorithm which optimally solves this problem is of great importance. In this paper, we introduce to computer vision the Hochbaum’s pseudoflow (HPF) algorithm, which optimally solves the minimum s–t cut problem. We compare the performance of HPF, in terms of execution times and memory utilization, with three leading published algorithms: (1) Goldberg’s and Tarjan’s Push-Relabel; (2) Boykov’s and Kolmogorov’s augmenting paths; and (3) Goldberg’s partial augment-relabel. While the common practice in computer-vision is to use either BK or PRF algorithms for solving the problem, our results demonstrate that, in general, HPF algorithm is more efficient and utilizes less memory than these three algorithms. This strongly suggests that HPF is a great option for many real-time computer-vision problems that require solving the minimum s–t cut problem.     

Enterprise Social Networks as Digital Infrastructures - Understanding the Utilitarian Value of Social Media at the Workplace

ABSTRACT

In this study, we first show that while both the perceived usefulness and perceived enjoyment of enterprise social networks impact employees’ intentions for continuous participation, the utilitarian value significantly outpaces its hedonic value. Second, we prove that the network’s utilitarian value is constituted by its digital infrastructure characteristics: versatility, adaptability, interconnectedness and invisibility-in-use. The study is set within a software engineering company and bases on quantitative survey research, applying partial least squares structural equation modeling.